Contention-sensitive data structures and algorithms
نویسندگان
چکیده
منابع مشابه
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or when processes with non-interfering operations access it concurrently. When a process invokes an operation on a contentionsensitive data structure, in the absence of contention or interference, the process must be abl...
متن کاملData Structures and Algorithms
The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms. Good examples and problems. Focus on methods rather than specific problems. Reference book devoted to NP-completeness. The second half contains an extensive list of NP-co...
متن کاملData Structures and Algorithms
In this article we provide an introduction to data structures and algorithms. We consider some basic data structures and deal with implementations of a dictionary and a priority queue. Algorithms for such basic problems as matrix multiplication, binary search, sorting, and selection are given. The concepts of randomized computing and parallel computing are also visited.
متن کاملRank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + l) time, where t(n) is the cost of traversing the structure and l ≤ n is the number of reported items satisfying the query. In this paper we focus on rank-sensitive data structures, which are additionally given a ranking of the n items, so that just t...
متن کاملEfficient Algorithms and Data Structures
The proposed project will address some of the fundamental issues in efficient algorithms and data structures, ranging from pseudo-random hashing, to the existence of deterministic dictionaries with constant update and look-up time, to graph algorithms. The applicant is a leading figure in the area of efficient algorithms and data structures. For the last 14 years he has been in the USA where th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.03.017